The Predecessors Within . . .
نویسندگان
چکیده
منابع مشابه
Predecessors of preprint servers
Although there was an early experiment in the 1960s with the central distribution of paper preprints in the biomedical sciences, these sciences have not been early adopters of electronic preprint servers. Some barriers to the development of a ‘preprint culture’ in the biomedical sciences are described. Multiple factors that, from the 1960s, fostered the transition from a paper-based preprint cu...
متن کاملSemmelWeis and his predecessors.
IGNAZ SEMMELWEIS is generally known for identifying puerperal fever as an infectious disease preventable by aseptic methods. While no-one today would contest the importance, the practicality, or the independence of his contribution, its originality has been disputed from the beginning. When Semmelweis first reported his ideas in Vienna, a veterinarian claimed priority for the discovery.' The fi...
متن کاملheterogeneity within the orientalist discourse: representation of the orient in womens travelogues and mens paintings
from 1950s onward, new theories and critical approaches burgeoned across humanities. these theories were context-oriented; as a result, the analysis of discursive practices gained significance. thus, social, political, historical and cultural discourses that have been hitherto marginalized and considered inferior to literary texts, were introduced as important texts to be analyzed by critics. o...
On the r.e. predecessors of d.r.e. degrees
Let d be a Turing degree containing differences of recursively enumerable sets (d.r.e.sets ) and R[d] be the class of less than d r.e.degrees in which d is relatively enumerable (r.e.). A.H.Lachlan proved that for any non-recursive d.r.e. d R[d] is not empty. We show that the r.e.degree defined by Lachlan for a d.r.e.set D ∈d is just the minimum degree in which D is r.e. Then we study for a giv...
متن کاملRandom input helps searching predecessors
We solve the dynamic Predecessor Problem with high probability (whp) in constant time, using only n bits of memory, for any constant δ > 0. The input keys are random wrt a wider class of the well studied and practically important class of (f1, f2)-smooth distributions introduced in [3]. It achieves O(1) whp amortized time. Its worst-case time is O( √ logn log logn ). Also, we prove whp O(log lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cell
سال: 2018
ISSN: 0092-8674
DOI: 10.1016/j.cell.2018.03.023